搜索资源列表
xiaochong
- Dijsktra算法，Java源码，此代码可以计算任意两点之间的最短距离。-Dijsktra algorithms, Java source code, the code can calculate the shortest distance between any two points.
shortestDistance-Dijkstra
- 利用地杰斯特拉算法求两点之间的最短距离，用C语言实现，经过验证。-Tel algorithm used to find Jess the shortest distance between two points
choose_best_address
- 数据结构 寻径问题。内容：给定n个村庄之间的交通图，若村庄i和村庄j之间有道路，则将顶点i和顶点j用边连接，边上的权Wij 表示这条道路的长度。现在要从这n个村庄选择一个村庄建一所医院，问这所医院应建在哪个村庄，才能使离医院最远的村庄到医院的距离最短？-Routing data structure problem. Content: Given n traffic between villages map, if the village i and the road between the vi
Dijkstra
- 经过修改后的Dijkstra算法的c++实现，可以输出任意点到初始点的最短距离。-After the modified Dijkstra algorithm c++ implementation of any point can be output to the initial point of the shortest distance.
cpair
- 用分治法求平面两点的最短距离，main函数用随机数生成n个随机数，然后求他们的最短距离-Plane with the Method of the shortest distance between two points, main function uses the random number generator random number n, and then find the shortest distance between them
TSPga.m
- 应用遗传算法来解决多个点的遍历且满足距离最短问题-Application of genetic algorithm to solve the multiple points of traversing the shortest distance problems and meet
ACATSP.m
- 应用蚁群算法来解决所有点的遍历且距离最短的问题-Ant colony algorithm to solve all the points of the traversal and shortest distance problems
py-opengl
- 程序采用的算法是，最短距离法，源程序由三个文件组成。 CoordinateTransformation.py模块 主要负责将轮廓线进行处理，从而使他们在一个平面的单位正方形内。 PointPair.py模块 主在负责将接收经过CoordinateTransformation处理后两层轮廓线数据，对他们使用最短距离法从而将每个三角片的三个顶点确定下来，并返回其索引值 Main.py 主要负责调opengl以及组织和显示。 -Program uses the algori
xiaoyuan
- 校园导航程序，支持任意数的顶点和边数，直接输入即可，可以查询两点间的所有路径，最短距离，Dijstra和Floyd算法都有-Campus navigation, support for any number of vertices and edges, can be directly input, you can query all paths between two points, the shortest distance, Dijstra and Floyd algorithm has
nixushuzuiduanlujing
- 该文件夹中包括几个acm比赛中用到的模板 求逆序数，无向图的bfs收索，有向图中的两点间的最短距离。希望对大家有用。-The folder includes several templates used in the game acm find reverse numbers, income bfs undirected graph cable, directed graph in the shortest distance between two points. Hope that use
dijkstra
- 地杰斯特拉算法，实现确定图中任意两点间的最短距离，并显示最短路径-Jess Terra algorithm to achieve an arbitrary figure to determine the shortest distance between two points and displays the shortest path
floyd
- 弗洛伊的算法是实现图中两点之间的最短距离，并显示路径-Freud' s method is to achieve the figure the shortest distance between two points, and shows the path
tu
- 用邻接矩阵表示无向网，应显示所选中的村庄到各村庄的最短距离。 -With the adjacency matrix of undirected networks, should show the selected villages to the shortest distance of the village.
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
distBW2lines
- 计算在N维空间中，两条线之间的最短距离，N可以是3或者3以上的任何数值-Calculated in N-dimensional space, the shortest distance between two lines, N could be any of 3 or more values 3
GraphA
- 数据结构里关于有向图传递闭包算法求出两点间最短距离的部分资料-Data structure diagram on a transitive closure algorithm to find the shortest distance between two points some of the information
Floyd
- 使用Floyd算法球出任意两点的最短距离。-Floyd algorithm ball out of the shortest distance between any two points.
Floyd_Warshall
- 使用Floyd_Warshall算法球出任意两点的最短距离。-Floyd_Warshall algorithm using the ball out of the shortest distance between any two points.
BFSApp
- 利用BFSApple算法求出两点之间的最短距离。-BFSApple algorithm using the shortest distance between two points is calculated.
DFSApp
- 利用DFSApple算法求出两点之间的最短距离。-DFSApple algorithm using the shortest distance between two points is calculated.